Context-Freeness of Higman-Thompson group’s co-word problem
نویسندگان
چکیده
The co-word problem of a group G generated by a set X is defined as the set of words in X which do not represent 1 in G. We introduce a new method to decide if a permutation group has context-free co-word problem. We use this method to show, that the Higman-Thompson groups, and therefore the Houghton groups, have context-free co-word problem. We also give some examples of groups, that even have an easier co-word problem. We call this property semi-deterministic context-free. The second Houghton group belongs to this class.
منابع مشابه
Groups with Indexed Co-word Problem
We investigate co-indexed groups, that is groups whose co-word problem (all words defining nontrivial elements) is an indexed language. We show that all Higman-Thompson groups and a large class of tree automorphism groups defined by finite automata are co-indexed groups. The latter class is closely related to dynamical systems and includes the Grigorchuk 2-group and the Gupta-Sidki 3-group. The...
متن کاملFactorizations of the Thompson-higman Groups, and Circuit Complexity
We consider the subgroup lpGk,1 of length preserving elements of the Thompson-Higman group Gk,1 and we show that all elements of Gk,1 have a unique lpGk,1 · Fk,1 factorization. This applies to the Thompson-Higman group Tk,1 as well. We show that lpGk,1 is a “diagonal” direct limit of finite symmetric groups, and that lpTk,1 is a k ∞ Prüfer group. We find an infinite generating set of lpGk,1 whi...
متن کاملMonoid generalizations of the Richard Thompson groups
The groups Gk,1 of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call Mk,1, and to inverse monoids, called Invk,1; this is done by simply generalizing bijections to partial functions or partial injective functions. The monoids Mk,1 have connections with circuit complexity (studied in another paper). Here we prove that Mk,1 and Invk,1 are congruence-s...
متن کاملInterpretation of the Arithmetic in Certain Groups of Piecewise Affine Permutations of an Interval Tuna Altinel and Alexey Muranov
The Arithmetic is interpreted in all the groups of Richard Thompson and Graham Higman, as well as in other groups of piecewise affine permutations of an interval which generalize the groups of Thompson and Higman. In particular, the elementary theories of all these groups are undecidable. Moreover, Thompson’s group F and some of its generalizations interpret the Arithmetic without parameters.
متن کاملMore on the Size of Higman-Haines Sets: Effective Constructions
A not so well-known result in formal language theory is that the Higman-Haines sets for any language are regular [11, Theorem 4.4]. It is easily seen that these sets cannot be effectively computed in general. The Higman-Haines sets are the languages of all scattered subwords of a given language as well as the sets of all words that contain some word of a given language as a scattered subword. R...
متن کامل